Semi-Robust Communications Over a Broadcast Channel

Semi-Robust Communications over a Broadcast Channel

We establish the deterministic-code capacity region of a network with one transmitter and two receivers: an “ordinary receiver” and a “robust receiver.” The channel to the ordinary receiver is a given (known) discrete memoryless channel (DMC), whereas the channel to the robust receiver is an arbitrarily varying channel (AVC). Both receivers are required to decode the “common message,” whereas o...

A Novel Geo-Broadcast Algorithm for V2V Communications over WSN

The key for enabling the next generation of advanced driver assistance systems (ADAS), the cooperative systems, is the availability of vehicular communication technologies, whose mandatory installation in cars is foreseen in the next few years. The definition of the communications is in the final step of development, with great efforts on standardization and some field operational tests of netw...

Interactive Coding Over the Noisy Broadcast Channel

A set of n players, each holding a private input bit, communicate over a noisy broadcast channel. Their mutual goal is for all players to learn all inputs. At each round one of the players broadcasts a bit to all the other players, and the bit received by each player is flipped with a fixed constant probability (independently for each recipient). How many rounds are needed? This problem was fir...

Robust Multimedia Communications over Packet Networks

Key agreement over a 3-receiver broadcast channel

In this paper, we consider the problem of secret key agreement in state-dependent 3-receiver broadcast channels. In the proposed model, there are two legitimate receivers, an eavesdropper and a transmitter where the channel state information is non-causally available at the transmitter. We consider two setups. In the first setup, the transmitter tries to agree on a common key with the legitimat...